//	ID : pallab81
// 	PROG : 10910
// 	LANG : C++
// 	2011-08-30-18.35.15 Tuesday
//
// 	"I have not failed, I have just found 10000 ways that won't work.
//


#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define VI vector< int >
#define CI( x ) scanf("%d",&x)
#define CL( x ) scanf("%lld",&x)
#define CD( x ) scanf("%lf",&x )
#define fo(i,st,ed) for(int i = st ; i < ed ; ++i )
#define foE(i,st,ed) for(int i = st ; i <= ed ; ++i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define f first
#define s second
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )

inline void wait( double seconds ){
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while( clock() < endtime ){
        ;
    }
}

int N,T,P;
int dp[71][71];
inline void Read(){
        CI(N);
        CI(T);
        CI(P);
}
// ts = total subjects
// s = now sum
int go(int ts , int s){
    if(ts==0){
        return ( s == 0 ? 1 : 0 ) ;
    }

    int &total=dp[ts][s];
    if(total!=-1){
        return total;
    }
    total=0;
    for(int take=P; ;++take){
        if( s-take < (ts-1)*P )break;
        total+=go(ts-1, s-take);
    }
return total;
}
inline void Proc(){
    SET(dp,-1);
    int v = go(N,T);
    printf("%d\n",v);
}
int main(){
    #ifndef ONLINE_JUDGE
        freopen("in.txt","rt",stdin);
    #endif

    int cases=1;
    for( CI(cases) ; cases ; --cases ){
        Read();
        Proc();
    }

return 0;
}
